Перевод: с английского на русский

с русского на английский

complete distance

См. также в других словарях:

  • Distance matrices in phylogeny — Distance matrices are used in phylogeny as non parametric distance methods were originally applied to phenetic data using a matrix of pairwise distances. These distances are then reconciled to produce a tree (a phylogram, with informative branch… …   Wikipedia

  • Distance Focale — Cet article fait partie de la série Photographie …   Wikipédia en Français

  • Complete spatial randomness — (CSR) describes a point process whereby point events occur within a given study area in a completely random fashion. Such a process is often modeled using only one parameter, i.e. the density of points, ρ within the defined area. This is also… …   Wikipedia

  • Complete graph — K7, a complete graph with 7 vertices Vertices n Edges …   Wikipedia

  • Complete metric space — Cauchy completion redirects here. For the use in category theory, see Karoubi envelope. In mathematical analysis, a metric space M is called complete (or Cauchy) if every Cauchy sequence of points in M has a limit that is also in M or,… …   Wikipedia

  • Complété d'un espace — Espace complet En mathématiques, un espace métrique M est dit complet ou espace complet si toute suite de Cauchy de M a une limite dans M (c’est à dire qu elle converge dans M). La propriété de complétude dépend de la distance. Il est donc… …   Wikipédia en Français

  • Distance-transitive graph — The Biggs Smith graph, the largest 3 regular distance transitive graph. Graph families defined by their automorphisms distance transitive …   Wikipedia

  • Complete-linkage clustering — In cluster analysis, complete linkage or farthest neighbour is a method of calculating distances between clusters in agglomerative hierarchical clustering. In complete linkage,[1] the distance between two clusters is computed as the maximum… …   Wikipedia

  • Distance-hereditary graph — A distance hereditary graph. In graph theoretic mathematics, a distance hereditary graph (also called a completely separable graph)[1] is a graph in which the distances in any connected induced subgraph are the same as they are in the original… …   Wikipedia

  • distance — n. & v. n. 1 the condition of being far off; remoteness. 2 a a space or interval between two things. b the length of this (a distance of twenty miles). 3 a distant point or place (came from a distance). 4 the avoidance of familiarity; aloofness;… …   Useful english dictionary

  • Distance-regular graph — Graph families defined by their automorphisms distance transitive distance regular strongly regular …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»